Software and hardware implementation of hyperelliptic curve cryptosystems

نویسنده

  • Thomas Wollinger
چکیده

The hyperelliptic curve cryptosystem is one of the emerging cryptographic primitives of the last years. This system offers the same security as established public-key cryptosystems, such as those based on RSA or elliptic curves, with much shorter operand length. Consequently, this system allows highly efficient computation of the underlying field arithmetic. However, until recently the common belief in industry and in the research community was that hyperelliptic curves are out of scope for any practical application. The reason being the complex group operation leading to a worse overall performance compared to established public-key primitives. The thesis at hand is a step towards the practical use of hyperelliptic curve cryptosystems (HECC) by narrowing the performance gap between elliptic curve (EC) and hyperelliptic curve cryptosystems. We were able to reduce the complexity of the group operation for small genus hyperelliptic curves and we provide efficient algorithms for the computation of the hyperelliptic curve cryptosystem. Our theoretical comparison between elliptic curve and hyperelliptic curve cryptosystems, as well as our software and hardware implementations show that the performance of both cryptographic primitives are in the same range. Surprisingly, the hyperelliptic curve cryptosystems even outperforms elliptic curves using certain curve parameters. The implementations we investigated range from a general purpose processor to a variety of different embedded processors, and also includes the prototype implementation of a hyperelliptic curve coprocessor on FPGAs. We were able to lower the complexity of the hyperelliptic curve group operations compared to the best known formulae. The highest performance on an embedded system was achieved on the ARM7TDMI running at 80MHz. The scalar multiplication (for a group order of approximately 2) for ECC, genus-2 HECC, and genus-3 HECC could be computed in about 100 milliseconds. More detailed analysis show that on embedded

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HW/SW co-design of a hyperelliptic curve cryptosystem using a microcode instruction set coprocessor

Hardware/software co-design of computationally intensive cryptosystems is the preferred solution to achieve the required speed for resource-limited embedded applications. This paper presents a microcode instruction set coprocessor which is designed to work with 8bit microcontrollers to implement a hyperelliptic curve cryptosystem. The microcode coprocessor is capable of performing a range of Ga...

متن کامل

Hardware Architectures proposed for Cryptosystems Based on Hyperelliptic Curves

Security issues play an important role in almost all modern communication and computer networks. The foundation of IT security are cryptographic systems, for example hyperelliptic curves cryptosystems (HECC). The advantage of HECC is that they allow encryption with shorter operands and at the same time, they provide the same level of security as other public-key cryptosystems, based on the inte...

متن کامل

Software Implementation of Genus-2 Hyperelliptic Curve Cryptosystems Over Prime Fields

This paper describes the system parameters and software implementation of a HECDSA cryptosystem based on genus-2 hyperelliptic curves over prime fields. We show how to reduce the computational complexity for special cases and compare the given cryptosystem with the well-known ECDSA cryptosystem based on elliptic curves.

متن کامل

Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n

We investigate the discrete logarithm problem over jacobians of hyperelliptic curves suitable for public-key cryptosystems. We focus on the case when the definition field has small characteristic 2, 3, 5 and 7, then we present hyperelliptic cryptosystems that resist against all known attacks. We further implement our designed hyperelliptic cryptosystems over finite fields F2n in software on Alp...

متن کامل

Improvements of Addition Algorithm on Genus 3 Hyperelliptic Curves and Their Implementation

Genus 3 hyperelliptic curve cryptosystems are capable of fast-encryption on a 64-bit CPU, because a 56-bit field is enough for their definition fields. Recently, Kuroki et al. proposed an extension of the Harley algorithm, which had been known as the fastest addition algorithm of divisor classes on genus 2 hyperelliptic curves, on genus 3 hyperelliptic curves and Pelzl et al. improved the algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004